منابع مشابه
Some Results on Convexity and Concavity of Multivariate Copulas
This paper provides some results on different types of convexity and concavity in the class of multivariate copulas. We also study their properties and provide several examples to illustrate our results.
متن کاملDetection of convexity and concavity in context.
Sensitivity to shape changes was measured, in particular detection of convexity and concavity changes. The available data are contradictory. The author used a change detection task and simple polygons to systematically manipulate convexity/concavity. Performance was high for detecting a change of sign (a new concave vertex along a convex contour or a new convex vertex along a concave contour). ...
متن کاملThroughput Concavity and Response Time Convexity
Throughput and response time are two performance measures which are commonly used to judge a system’s performance. As a result, it is important to determine the effect upon throughput and response time as other system parameters are varied. The parameter considered in this paper is the multiprogramming level. Attention is restricted to single-class, closed, product-form networks [2]. Only basic...
متن کاملDynamic Programming with Convexity, Concavity, and Sparsity
A fast algorithm for computing longest common subse-quences. [J82] Johnson, D. B. A priority queue in which initialization and queue operations take O(log log D) Pattern recognition in nucleic acid sequences II: an ecient method for nding locally stable secondary structures. A simple linear time algorithm for concave one-dimensional dynamic programming. preprint, 1990. almost linear time algori...
متن کاملBell Numbers, Log-concavity, and Log-convexity
Let fb k (n)g 1 n=0 be the Bell numbers of order k. It is proved that the sequence fb k (n)=n!g 1 n=0 is log-concave and the sequence fb k (n)g 1 n=0 is log-convex, or equivalently, the following inequalities hold for all n 0, 1 b k (n + 2)b k (n) b k (n + 1) 2 n + 2 n + 1 : Let f(n)g 1 n=0 be a sequence of positive numbers with (0) = 1. We show that if f(n)g 1 n=0 is log-convex, then (n)(m) (n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Issues of Analysis
سال: 2015
ISSN: 2306-3432
DOI: 10.15393/j3.art.2015.2709